Sphere Packing for Regularisation of Lattice Domes
نویسندگان
چکیده
The paper provides a methodology for finding a family of patterns for lattice domes, created based on the “Surface Sphere Packing” concept. The patterns have a high degree of regularity in the sense of a high percentage of the elements being of the same length. Also, parametric formulation for generating such patterns are discussed. This gives an opportunity for creating more regular patterns with different parameters, using the programming language Formian.
منابع مشابه
METAHEURISTIC-BASED SIZING AND TOPOLOGY OPTIMIZATION AND RELIABILITY ASSESSMENT OF SINGLE-LAYER LATTICE DOMES
Economy and safety are two important components in structural design process and stablishing a balance between them indeed results in improved structural performance specially in large-scale structures including space lattice domes. Topology optimization of geometrically nonlinear single-layer lamella, network, and geodesic lattice domes is implemented using enhanced colliding-bodies optimizati...
متن کاملPerfect, Strongly Eutactic Lattices Are Periodic Extreme
We introduce a parameter space for periodic point sets, given as a union of m translates of a point lattice. In it we investigate the behavior of the sphere packing density function and derive sufficient conditions for local optimality. Using these criteria we prove that perfect, strongly eutactic lattices cannot be locally improved to yield a denser periodic sphere packing. This in particular ...
متن کاملLocal Covering Optimality of Lattices : Leech Lattice versus Root Lattice E 8
The Leech lattice is the exceptional lattice in dimension 24. Soon after its discovery by Leech [9], it was conjectured that it is extremal for several geometric problems in R: the kissing number problem, the sphere packing problem, and the sphere covering problem. In 1979, Odlyzko and Sloane and independently Levenshtein solved the kissing number problem in dimension 24 by showing that the Lee...
متن کاملSpatial statistics for lattice points on the sphere I: Individual results
We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares. We examine several statistics of these point sets, such as the electrostatic potential, Ripley's function, the variance of the number of points in random spherical caps, and the covering radius. Some of the results are conditional on t...
متن کاملThe sphere packing problem
Hales, T.C., The sphere packing problem, Journal of Computational and Applied Mathematics 44 (1992) 41-76. The sphere packing problem asks whether any packing of spheres of equal radius in three dimensions has density exceeding that of the face-centered-cubic lattice packing (of density IT/V%). This paper sketches a solution to this problem.
متن کامل